Fitness Distance Correlation, as statistical measure of Genetic Algorithm difficulty, revisited
نویسندگان
چکیده
This paper revisits past works on fitness distance correlation (FDC) in relation to genetic algorithms (GA) performance, and puts forth evidence that this statistical measure is relevant to predict the performance of a GA. We propose an interpretation of Hamming-distance based FDC, which takes into account the GA dynamics and the effects of crossover operator. We base this proposition on the notion of predicates developed by Vose. The aim of this article is double since, using results obtained with the FDC, it confirms Vose's theory, and starting from this theory, it corroborates FDC as a relevant predictor measure of problem difficulty for GAs.
منابع مشابه
Fitness Distance Correlation And Problem Difficulty For Genetic Programming
This work is a first step in the attempt to verify whether (and in which cases) fitness distance correlation can be a good tool for classifying problems on the basis of their difficulty for genetic programming. By analogy with the studies that have already been done on genetic algorithms, we define some notions of distance between genotypes. Then we choose one of these distances to calculate th...
متن کاملFitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Ameasure of search di culty tness distance correlation FDC is introduced and exam ined in relation to genetic algorithm GA performance In many cases this correlation can be used to predict the performance of a GA on problems with known global maxima It correctly classi es easy deceptive problems as easy and di cult non deceptive problems as di cult indicates when Gray coding will prove better t...
متن کاملOn functions with a given fitness–distance relation
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the fitness distance correlation (FDC) value cannot be reliably related to landscape difficulty, we investigate whether an interpretation of the whole correlation plot can yield reliable information about the behavior of the GA. Our appr...
متن کاملOn Functions with a Fixed Fitness Versus Distance-to-Optimum Relation
Recent work stresses the limitations of fitness distance correlation (FDC) as an indicator of landscape difficulty for genetic algorithms (GAs). Realizing that the correlation value cannot be reliably related to landscape difficulty, we investigate in this paper whether an interpretation of the correlation plot can yield reliable information about the behavior of the GA. Our approach is as foll...
متن کاملFitness Distance Correlation , as statisticalmeasure of Genetic
This paper revisits past works on tness distance correlation (FDC) in relation to genetic algorithms (GA) performance , and puts forth evidence that this statistical measure is relevant to predict the performance of a GA. We propose an interpretation of Hamming-distance based FDC, which takes into account the GA dynamics and the eeects of crossover operator. We base this proposition on the noti...
متن کامل